Edge‐decomposing graphs into coprime forests
نویسندگان
چکیده
منابع مشابه
Edge-decomposing graphs into coprime forests
The Barát-Thomassen conjecture, recently proved in [3], asserts that for every tree T , there is a constant cT such that every cT -edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T -decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For i...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملThe decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
In this paper a graph is considered as finite, undirected, with single lines and no loops. The arboricity of a graph G, denoted by Y(G), is the least number of line-disjoint spanning forests into which G can be partitioned. {x} is the least integer not less than X, and A(G) is the maximum degree among the points of G. V(G), E(G), and ISI denote the point set of G, the line set of G, and the num...
متن کاملCoprime and Prime Labelings of Graphs
A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss c...
متن کاملEdge Partition of Toroidal Graphs into Forests in Linear Time
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be embedded on the orientable surface of genus one without edge crossing, into three forests plus a set of at most three edges. For triangulated toroidal graphs, this algorithm gives a linear algorithm for finding three edge-disjoint spanning trees. This is in a certain way an extension of the well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22638